案例教学法在学前教育学课程教学中的运用

学前教育学课程是学前教育专业学生系统学习本专业知识的认知起点,在教学中运用案例教学法能弥补学生对本专业的感性认知和实践经验的缺乏,对于教师的"教"、学生的"学"和师生之间、生生之间的互动都有十分重要而有益的价值。本文诠释了案例教学法的基本内涵,在此基础上论述了案例教学法在学前教育学课程教学中的重要价值,最后探讨了在学前教育学课程教学中案例教学法的实施过程和应当注意的问题。     

基于地理信息系统检索的可视化方法

文章主要对地理信息系统中检索功能的基本涵义和研究现状进行了介绍,根据地理信息系统中检索功能实现的基本流程．着重阐述了检索过程中常用的可视化方法。最后对检索效果的评价标准以及目前面临的主要问题进行了介绍．为相关系统的设计与开发提供了一定的参考。     

案例教学法在《火灾证据学》课程中的运用研究

为了培养学员的综合素质和创新能力,《火灾证据学》课程引入了案例教学法。分析《火灾证据学》课程运用案例教学法的教学效果,提出运用案例教学法的基本形式及其相关要求。     

Improved bounds for batch scheduling with nonidentical job sizes

Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on single and parallel identical machines, with the objective of minimizing the makespan. For the single machine case, we present an algorithm which calls an online algorithm (chosen arbitrarily) for the one‐dimensional bin‐packing problem as a sub‐procedure, and prove that its worst‐case ratio is the same as the absolute performance ratio of . Hence, there exists an algorithm with worst‐case ratio , which is better than any known upper bound on this problem. For the parallel machines case, we prove that there does not exist any polynomial‐time algorithm with worst‐case ratio smaller than 2 unless P = NP, even if all jobs have unit processing time. Then we present an algorithm with worst‐case ratio arbitrarily close to 2. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 351–358, 2014     

基于虚拟现实技术的案例式反恐指挥训练

本文探讨将虚拟现实技术引入案例式反恐指挥训练，首先分析基于虚拟现实技术案例式指挥训练的理论依据；对案例式VR反恐指挥训练的流程进行设计，并确定案例式VR反恐指挥训练内容；对训练中应把握的原则进行了明确，研究创新部队指挥训练形式具有参考价值。     

MFSK/FFH系统分集合并算法性能对比研究

推导了部分频带干扰最佳干扰系数表达式并进行了仿真验证,描述了多进制频移键控/快跳频(MFSK/FFH)系统、衰落信道和分集合并算法模型,在最坏部分频带干扰和衰落信道下,仿真对比了MFSK/FFH系统采用线性分集合并、限幅线性分集合并、自归一分集合并、排序统计自归一分集合并、乘积分集合并5种分集合并算法时的误码率性能,结果表明:在最坏部分频带干扰和衰落信道下,线性合并性能较差,其他4种算法性能较为相似,Rayleigh衰落信道中排序统计自归一分集合并和乘积分集合并算法性能最优。     

Two‐machine flow shop no‐wait scheduling with a nonavailability interval

We study a two‐machine flow shop scheduling problem with no‐wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst‐case ratio of 3/2. For the second scenario, we offer a 4/3‐approximation algorithm. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

一种基于UML/OCL的软件测试方法

根据UML/OCL和建模环境提供的软件模型信息,以一个武器装备管理信息系统的装备入库顺序图为例,在分析UML/OCL顺序图的语法和对象间的交互信息的基础上产生测试场景,提供了一种基于UML/OCL的面向对象的软件测试方法,并提出测试自动化的设想,对软件测试有一定的借鉴作用。     

Bin‐packing problem with concave costs of bin utilization

We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Analysis of practical policies for a single link distribution system

In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007